Improved Sparse Multivariate Polynomial Interpolation Algorithms
نویسندگان
چکیده
We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of equations, the use of which greatly improves the time complexities of the two interpolation algorithms.
منابع مشابه
Asymptotically Optimal Monte Carlo Sparse Multivariate Polynomial Interpolation Algorithms of Straight-Line Program
In this paper, we propose new deterministic interpolation algorithms and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let f be an n-variate polynomial with a degree bound D and and term bound T . Our deterministic algorithms have better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Ca...
متن کاملSparse Polynomial Interpolation with Finitely Many Values for the Coefficients
In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(β) for a sufficiently large number β. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorith...
متن کاملSparse Rational Function Interpolation with Finitely Many Values for the Coefficients
In this paper, we give new sparse interpolation algorithms for black box univariate and multivariate rational functions h = f/g whose coefficients are integers with an upper bound. The main idea is as follows: choose a proper integer β and let h(β) = a/b with gcd(a, b) = 1. Then f and g can be computed by solving the polynomial interpolation problems f(β) = ka and g(β) = ka for some integer k. ...
متن کاملEarly termination in sparse interpolation algorithms
A probabilistic strategy, early termination, enables different interpolation algorithms to adapt to the degree or the number of terms in the target polynomial when neither is supplied in the input. In addition to dense algorithms, we implement this strategy in sparse interpolation algorithms. Based on early termination, racing algorithms execute simultaneously a dense and a sparse algorithm. Th...
متن کاملFaster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988